Nonoverlapping domain decomposition methods with a simple coarse space for elliptic problems
نویسندگان
چکیده
منابع مشابه
Nonoverlapping domain decomposition methods with a simple coarse space for elliptic problems
We propose a substructuring preconditioner for solving threedimensional elliptic equations with strongly discontinuous coefficients. The new preconditioner can be viewed as a variant of the classical substructuring preconditioner proposed by Bramble, Pasiack and Schatz (1989), but with much simpler coarse solvers. Though the condition number of the preconditioned system may not have a good boun...
متن کاملNonoverlapping Domain Decomposition Methods with Simplified Coarse Spaces for Solving Three-dimensional Elliptic Problems
In this paper we propose a substructuring preconditioner for solving three-dimensional elliptic equations with strongly discontinuous coefficients. The new preconditioner can be viewed as a variant of the classical substructuring preconditioner introduced in Bramble, Pasiack and Schatz (1989), with simpler coarse solvers. We will show that, although the preconditioned system may not have a good...
متن کاملSome Nonoverlapping Domain Decomposition Methods
The purpose of this paper is to give a unified investigation of a class of nonoverlapping domain decomposition methods for solving second-order elliptic problems in two and three dimensions. The methods under scrutiny fall into two major categories: the substructuring–type methods and the Neumann–Neumann-type methods. The basic framework used for analysis is the parallel subspace correction met...
متن کاملA Parallel Nonoverlapping Schwarz Domain Decomposition Method for Elliptic Interface Problems
We present a parallel nonoverlapping Schwarz domain decomposition method with interface relaxation for linear elliptic problems, possibly with discontinuities in the solution and its derivatives. This domain decomposition method can be characterized as: the transmission conditions at the interface of subdomains are taken to be Dirichlet at odd iterations and Neumann at even iterations. The conv...
متن کاملNonoverlapping Domain Decomposition Algorithms for the p-version Finite Element Method for Elliptic Problems
The nonoverlapping domain decomposition methods form a class of domain decomposition methods, for which the information exchange between neighboring subdomains is limited to the variables directly associated with the interface, i.e. those common to more than one subregion. Our objective is to design algorithms in 3D for which we can find an upper bound on the condition number κ of the precondit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2010
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-10-02361-6